Schmidt-Mirsky matrix approximation with linearly constrained singular values
نویسندگان
چکیده
منابع مشابه
Singular constrained linear systems
In the linear system Ax = b the points x are sometimes constrained to lie in a given subspace S of column space of A. Drazin inverse for any singular or nonsingular matrix, exist and is unique. In this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of Drazin inverse in solving such systems is investigated. Constrained linear system arise ...
متن کاملMatrix Reconstruction with Prescribed Diagonal Elements, Eigenvalues, and Singular Values
DIAGONAL ELEMENTS, EIGENVALUES, AND SINGULAR VALUES DRAFT AS OF April 30, 2013 SHENG-JHIH WU AND MOODY T. CHU Abstract. Diagonal entries and eigenvalues of a Hermitian matrix, diagonal entries and singular values of a general matrix, and eigenvalues and singular values of a general matrix satisfy necessarily some majorization relationships which turn out also to be sufficient conditions. The in...
متن کاملLinearly constrained Bayesian matrix factorization for blind source separation
We present a general Bayesian approach to probabilistic matrix factorization subject to linear constraints. The approach is based on a Gaussian observation model and Gaussian priors with bilinear equality and inequality constraints. We present an efficient Markov chain Monte Carlo inference procedure based on Gibbs sampling. Special cases of the proposed model are Bayesian formulations of nonne...
متن کاملOn the Generalized Matrix Approximation Problems in the Spectral Norm
In this paper theoretical results regarding a generalized minimum rank matrix approximation problem in the spectral norm are presented. An alternative solution expression for the generalized matrix approximation problem is obtained. This alternative expression provides a simple characterization of the achievable minimum rank, which is shown to be the same as the optimal objective value of the c...
متن کاملSparse recovery based on q-ratio constrained minimal singular values
We study verifiable sufficient conditions and computable performance bounds for sparse recovery algorithms such as the Basis Pursuit, the Dantzig selector and the Lasso estimator, in terms of a newly defined family of quality measures for the measurement matrices. With high probability, the developed measures for subgaussian random matrices are bounded away from zero as long as the number of me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1997
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)80069-9